Sampling of Alternatives in Random Regret Minimization Models
نویسندگان
چکیده
منابع مشابه
Sampling of Alternatives in Random Regret Minimization Models
Sampling of alternatives is often required in discrete choice models to reduce the computational burden and to avoid describing a large number of attributes. This approach has been used in many areas, including modeling of route choice, vehicle ownership, trip destination, residential location, and activity scheduling. The need for sampling of alternatives is accentuated for Random Regret Minim...
متن کاملStochastic Regret Minimization via Thompson Sampling
The Thompson Sampling (TS) policy is a widely implemented algorithm for the stochastic multiarmed bandit (MAB) problem. Given a prior distribution over possible parameter settings of the underlying reward distributions of the arms, at each time instant, the policy plays an arm with probability equal to the probability that this arm has largest mean reward conditioned on the current posterior di...
متن کاملA New Model of Random Regret Minimization
A new choice model is derived, rooted in the framework of Random Regret Minimization (RRM). The proposed model postulates that when choosing, people anticipate and aim to minimize regret. Whereas previous regret-based discrete choice-models assume that regret is experienced with respect to only the best of foregone alternatives, the proposed model assumes that regret is potentially experienced ...
متن کاملRandom Walk Approach to Regret Minimization
We propose a computationally efficient random walk on a convex body which rapidly mixes to a time-varying Gibbs distribution. In the setting of online convex optimization and repeated games, the algorithm yields low regret and presents a novel efficient method for implementing mixture forecasting strategies.
متن کاملGeneralized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. While the base algorithm performs a full tree traversal on each iteration, Monte Carlo CFR (MCCFR) reduces the per iteration time cost by traversing just a sampled portion of the tree. On the other hand, MCCFR’s sampled v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2016
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.2014.0573